﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion



using System;
using System.Collections;
using NUnit.Framework;
using NUnit.Framework.SyntaxHelpers;

namespace NStl.NUnit.Support
{
    /// <summary>
    /// An abstract fixture to test any <see cref="IList"/> implementation.
    /// </summary>
    public abstract class ListFixture<T> : CollectionFixture
    {
        protected override ICollection CreateCollection()
        {
            return CreateList();
        }

        protected abstract IList CreateList();
        protected IList List
        {
            get { return (IList)Enumerable; }
        }
        [Test]
        public void Indexer()
        {
            for(int i = 0; i < List.Count; ++i)
                Assert.AreEqual(i, List[i]);
        }

        [Test]
        public void Add()
        {
            object toAdd = CreateNewUniqueItem();
            int i = List.Add(toAdd);

            Assert.That(List, Has.Member(toAdd));
            Assert.That(i, Is.EqualTo(List.Count - 1));
        }
        [Test]
        public void Clear()
        {
            List.Clear();
            Assert.That(List, Is.Empty);
        }

        [Test]
        public void Contains()
        {
            object inList = List[1];
            Assert.That(List.Contains(inList), Is.True);
        }
        [Test]
        public void ContainsFails()
        {
            object notInList = CreateNewUniqueItem();
            Assert.That(List.Contains(notInList), Is.False);
        }
        [Test]
        public void Remove()
        {
            object inList = List[1];
            int count = List.Count;

            List.Remove(inList);
            Assert.That(List.Contains(inList), Is.False);
            Assert.That(List.Count, Is.EqualTo(count - 1));
        }
        [Test]
        public void IndexerWrite()
        {
            for (int i = 0; i < List.Count; ++i)
                List[i] = default(T);

            for (int i = 0; i < List.Count; ++i)
                Assert.AreEqual(default(T), List[i]);
        }

        [Test]
        [ExpectedException(typeof(ArgumentOutOfRangeException))]
        public void IndexerFail()
        {
            object tmp = List[List.Count];
        }
        [Test]
        [ExpectedException(typeof(ArgumentOutOfRangeException))]
        public void IndexerFailNegative()
        {
            object tmp = List[-1];
        }

        [Test]
        public void Insert()
        {
            object initially = List[5];
            Assert.AreEqual(5, initially);

            T toAdd = CreateNewUniqueItem();

            List.Insert(5, toAdd);
            Assert.AreEqual(toAdd, List[5]);
            Assert.AreEqual(initially, List[6]);
        }

        protected abstract T CreateNewUniqueItem();
        [Test]
        public void RemoveAt()
        {
            object at5 = List[5];
            Assert.AreEqual(5, at5);
            object at6 = List[6];

            List.RemoveAt(5);
            Assert.AreEqual(at6, List[5]);
        }

        [Test]
        public void IndexOf()
        {
            for (int i = 0; i < List.Count; ++i)
            {
                object atI = List[i];
                Assert.AreEqual(i, List.IndexOf(atI));
            }
        }
    }
}
